- 布尔可满足性问题
- 布尔可足性
下载手机词典可随时随地查词查翻译
boolean satisfiability problem中文什么意思
百科释义
In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of determining if there exists an interpretation, which satisfies the formula. In other words, it establishes if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE.
详细百科解释